A lookahead algorithm for the solution of block toeplitz systems
نویسندگان
چکیده
منابع مشابه
A fast algorithm for Toeplitz-block-Toeplitz linear systems
ABSTRACT A Toeplitz-block-Toeplitz (TBT) matrix is block Toeplitz with Toeplitz blocks. TBT systems of equations arise in 2D interpolation, 2-D linear prediction and 2-D least-squares deconvolution problems. Although the doubly Toeplitz structure should be exploitable in a fast algorithm, existing fast algorithms only exploit the block Toeplitz structure, not the Toeplitz structure of the block...
متن کامل1 A look - ahead algorithm for the solution of block Toeplitz systems Marc
In this paper, we give a weakly stable algorithm to solve a block Toeplitz system of linear equations. If the \look-ahead" steps taken to compute the parameters of the inversion formula for the block Toeplitz matrix are small compared to the order n of the matrix, the algorithm requires O(n 2) oating point operations. The parameters of the inversion formula are interpreted and computed in a rec...
متن کاملOn Solving Block Toeplitz Systems Using a Block Schur Algorithm
This paper presents a block Schur algorithm to obtain a factorization of a symmetric block Toeplitz matrix. It is inspired by the various block Schur algorithms that have appeared in the literature but which have not considered the innuence of performance tradeoos on implementation choices. We develop a version based on block hyperbolic Householder reeectors by adapting the representation schem...
متن کاملArchitectures for block Toeplitz systems
In this paper efficient VLSI architectures of highly concurrent algorithms for the solution of block linear systems with Toeplitz or near-to-Toeplitz entries are presented. The main features of the proposed scheme are the use of scalar only operations, multiplications/divisions and additions, and the local communication which enables the development of wavefront array architecture. Both the mea...
متن کاملA Block Toeplitz Look-ahead Schur Algorithm
This paper gives a look-ahead Schur algorithm for nding the symmetric factorization of a Hermitian block Toeplitz matrix. The method is based on matrix operations and does not require any relations with orthogonal polynomials. The simplicity of the matrix based approach ought to shed new light on other issues such as parallelism and numerical stability.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1997
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(97)00013-x